Metropolis-Hastings algorithm
- Metropolis-Hastings algorithm
French\ \ algorithme de Metropolis-Hastings
German\ \ Metropolis-Hastings-Algorithmus
Dutch\ \ Metropolis-Hastings algorithme
Italian\ \ algoritmo di Metropolis-Hastings
Spanish\ \ algoritmo de Metropolis-Hastings
Catalan\ \ algoritme de Metropolis-Hastings
Portuguese\ \ algoritmo de Metropolis-Hastings
Romanian\ \ -
Danish\ \ Metropolis-Hastings algoritme
Norwegian\ \ -
Swedish\ \ Metropolis-Hastings algoritm
Greek\ \ αλγόριθμος Metropolis-Hastings
Finnish\ \ Metropolisin-Hastingsin algoritmi
Hungarian\ \ Metropolis-Hastings algoritmus
Turkish\ \ Metropolis-Hastings algoritması
Estonian\ \ -
Lithuanian\ \ -
Slovenian\ \ -
Polish\ \ -
Russian\ \ алгоритм Метрополиса-Гастингса
Ukrainian\ \ -
Serbian\ \ -
Icelandic\ \ Metropolis-Hastings reiknirit
Euskara\ \ Metropolis-Hastings bildu
Farsi\ \ -
Persian-Farsi\ \ الگوريتم متروپوليس-هستينگس
Arabic\ \ خوارزمية متروبوليس - هاستنكس
Afrikaans\ \ Metropolis-Hastings-algoritme
Chinese\ \ -
Korean\ \ 메트로폴리스-해스팅스 알고리즘
Statistical terms.
2014.
Look at other dictionaries:
Metropolis–Hastings algorithm — The Proposal distribution Q proposes the next point that the random walk might move to. In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a… … Wikipedia
Metropolis (disambiguation) — A metropolis (lit. mother city ) is a major city, defined in a variety of ways. Contents 1 Type of city 2 Places 2.1 Fictional places 3 Entertainment … Wikipedia
Metropolis light transport — The Metropolis light transport (MLT) is a SIGGRAPH 1997 paper by Eric Veach and Leonidas J. Guibas, describing an application of a variant of the Monte Carlo method called the Metropolis Hastings algorithm to the rendering equation for generating … Wikipedia
Nicholas Metropolis — Nicholas Constantine Metropolis Born June 11, 1915(1915 06 11) Chicago … Wikipedia
Multiple-try Metropolis — In Markov chain Monte Carlo, the Metropolis–Hastings algorithm (MH) can be used to sample from a probability distribution which is difficult to sample from directly. However, the MH algorithm requires the user to supply a proposal distribution,… … Wikipedia
Gibbs algorithm — In statistical mechanics, the Gibbs algorithm, first introduced by J. Willard Gibbs in 1878, is the injunction to choose a statistical ensemble (probability distribution) for the unknown microscopic state of a thermodynamic system by minimising… … Wikipedia
Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… … Wikipedia
Gibbs sampling — In statistics and in statistical physics, Gibbs sampling or a Gibbs sampler is an algorithm to generate a sequence of samples from the joint probability distribution of two or more random variables. The purpose of such a sequence is to… … Wikipedia
Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
